%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : PUZ136^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 18:26:06 EDT 2022

% Result   : Theorem 1.99s 2.26s
% Output   : Proof 1.99s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
thf(ty_zeus,type,
    zeus: $i ).

thf(ty_parent,type,
    parent: $i > $i > $o ).

thf(ty_sutekh,type,
    sutekh: $i ).

thf(ty_horus,type,
    horus: $i ).

thf(ty_kronus,type,
    kronus: $i ).

thf(sP1,plain,
    ( sP1
  <=> ( parent @ kronus @ zeus ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

thf(sP2,plain,
    ( sP2
  <=> ! [X1: $i,X2: $i] :
        ( ( parent @ kronus @ X1 )
       => ( parent @ kronus @ X2 ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ! [X1: $i] :
        ( sP1
       => ( parent @ kronus @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ! [X1: $i] :
        ( ( parent @ kronus @ horus )
       => ( parent @ X1 @ horus ) ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(sP5,plain,
    ( sP5
  <=> ! [X1: $i,X2: $i] :
        ( ( parent @ X1 @ horus )
       => ( parent @ X2 @ horus ) ) ),
    introduced(definition,[new_symbols(definition,[sP5])]) ).

thf(sP6,plain,
    ( sP6
  <=> ( sP1
     => ( parent @ kronus @ sutekh ) ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ( parent @ kronus @ horus ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

thf(sP8,plain,
    ( sP8
  <=> ( ( parent @ kronus @ sutekh )
     => sP7 ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ! [X1: $i] :
        ( ( parent @ kronus @ sutekh )
       => ( parent @ kronus @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ( parent @ sutekh @ horus ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

thf(sP11,plain,
    ( sP11
  <=> ( parent @ kronus @ sutekh ) ),
    introduced(definition,[new_symbols(definition,[sP11])]) ).

thf(sP12,plain,
    ( sP12
  <=> ! [X1: $i > $o,X2: $i,X3: $i] :
        ( ( X1 @ X2 )
       => ( X1 @ X3 ) ) ),
    introduced(definition,[new_symbols(definition,[sP12])]) ).

thf(sP13,plain,
    ( sP13
  <=> ( sP7
     => sP10 ) ),
    introduced(definition,[new_symbols(definition,[sP13])]) ).

thf(hotwo,conjecture,
    ~ sP12 ).

thf(h0,negated_conjecture,
    sP12,
    inference(assume_negation,[status(cth)],[hotwo]) ).

thf(1,plain,
    ( ~ sP3
    | sP6 ),
    inference(all_rule,[status(thm)],]) ).

thf(2,plain,
    ( ~ sP6
    | ~ sP1
    | sP11 ),
    inference(prop_rule,[status(thm)],]) ).

thf(3,plain,
    ( ~ sP9
    | sP8 ),
    inference(all_rule,[status(thm)],]) ).

thf(4,plain,
    ( ~ sP8
    | ~ sP11
    | sP7 ),
    inference(prop_rule,[status(thm)],]) ).

thf(5,plain,
    ( ~ sP4
    | sP13 ),
    inference(all_rule,[status(thm)],]) ).

thf(6,plain,
    ( ~ sP13
    | ~ sP7
    | sP10 ),
    inference(prop_rule,[status(thm)],]) ).

thf(7,plain,
    ( ~ sP5
    | sP4 ),
    inference(all_rule,[status(thm)],]) ).

thf(8,plain,
    ( ~ sP2
    | sP9 ),
    inference(all_rule,[status(thm)],]) ).

thf(9,plain,
    ( ~ sP2
    | sP3 ),
    inference(all_rule,[status(thm)],]) ).

thf(10,plain,
    ( ~ sP12
    | sP2 ),
    inference(all_rule,[status(thm)],]) ).

thf(11,plain,
    ( ~ sP12
    | sP5 ),
    inference(all_rule,[status(thm)],]) ).

thf(ax2,axiom,
    ~ sP10 ).

thf(ax1,axiom,
    sP1 ).

thf(12,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,10,11,ax2,ax1,h0]) ).

thf(0,theorem,
    ~ sP12,
    inference(contra,[status(thm),contra(discharge,[h0])],[12,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ136^1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat May 28 21:42:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.99/2.26  % SZS status Theorem
% 1.99/2.26  % Mode: mode506
% 1.99/2.26  % Inferences: 38867
% 1.99/2.26  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------